Flexible Stock Allocation and Trim Loss Control for Cutting Problem in the Industrial-Use Paper Production

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flexible Stock Allocation and Trim Loss Control for Cutting Problem in the Industrial - Use Paper Production

We consider a one-dimensional cutting stock problem (CSP) in which the stock widths are not used to fulfill the order but kept for use in the future for the industrial-use paper production. We present a new model based on the flexible stock allocation and trim loss control to determine the production quantity. We evaluate our approach using a real data and show that we are able to solve industr...

متن کامل

The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost

Nowadays, One-Dimensional Cutting Stock Problem (1D-CSP) is used in many industrial processes and re-cently has been considered as one of the most important research topic. In this paper, a metaheuristic algo-rithm based on the Simulated Annealing (SA) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. In this method, the 1D-...

متن کامل

One-dimensional Cutting Stock Problem (1d-csp): a Study on Data Dependent Trim Loss

A generalized approach is introduced for getting minimal trim in onedimensional cutting stock problem (1D-CSP) which occurs extensively while manufacturing of different engineering objects. Our study is especially focused on transmission tower manufacturing industry. The concept of computing total trim by using the idea of pre-defined sustainable trim has been explored in previous work of autho...

متن کامل

the trim loss concentration in one-dimensional cutting stock problem (1d-csp) by defining a virtual cost

nowadays, one-dimensional cutting stock problem (1d-csp) is used in many industrial processes and re-cently has been considered as one of the most important research topic. in this paper, a metaheuristic algo-rithm based on the simulated annealing (sa) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. in this method, the 1d-...

متن کامل

An ACO algorithm for one-dimensional cutting stock problem

The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2014

ISSN: 1024-123X,1563-5147

DOI: 10.1155/2014/521386